Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
نویسندگان
چکیده
منابع مشابه
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Many combinatorial optimization problems can be formulated as the minimization of a 0-1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme. The first phase consists in reformulating the initial problem either into a compact mixed integer linear program or into a 0-1 quadratic convex program....
متن کاملConvex Relaxations of (0, 1)-Quadratic Programming
We consider three parametric relaxations of the 0-1 quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix. When minimized over the parameter, each of the relaxations provides an upper bound on the original discrete problem. Moreover, these bounds are eec...
متن کاملSolving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations
We describe a branch and bound algorithm for the quadratic assignment problem QAP that uses a convex quadratic programming QP relaxation to obtain a bound at each node The QP subproblems are approximately solved using the Frank Wolfe algorithm which in this case requires the solution of a linear assignment problem on each iteration Our branching strategy makes extensive use of dual information ...
متن کاملConvex Quadratic Programming Relaxations for Network Scheduling Problems
In network scheduling a set of jobs must be scheduled on unrelated parallel processors or machines which are connected by a network. Initially, each job is located on some machine in the network and cannot be started on another machine until suucient time elapses to allow the job to be transmitted there. This setting has applications, e. g., in distributed multi-processor computing environments...
متن کاملConvex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Nonconvex quadratic constraints can be linearized to obtain relaxations in a wellunderstood manner. We propose to tighten the relaxation by using second order cone constraints, resulting in a convex quadratic relaxation. Our quadratic approximation to the bilinear term is compared to the linear McCormick bounds. The second order cone constraints are based on linear combinations of pairs of vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2008
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2008011